Constant Delay Linear Size Adder under Left-to-Right Input Arrival
نویسنده
چکیده
A parallel adder which is optimal in both delay and size under left-to-right input arrival is proposed. The delay is the computation time after the arrival of the nal input bits. The proposed adder is composed of a carry select adder (CSA) and a small adder based on the on-they conversion (OTFA). Parallel computation in the CSA and the OTFA which make full use of the delay of the input arrival yields a constant delay and linear size adder. This adder is e cient for various practical applications, such as an unfolded implementation of shift-and-subtract type division.
منابع مشابه
A High-Speed Reduced-Size Adder Under Left-to-Right Input Arrival
An efficient parallel adder under left-to-right input arrival is proposed. Making full use of the delay of the input arrival, it produces the sum within a small constant delay after the arrival of the final bits. Its amount of hardware is proportional to the operand length. It can be applied to the quotient conversion in an array divider.
متن کاملNon-Heuristic Optimization and Synthesis of Parallel-Prefix Adders
The class of parallel-prefix adders comprises the most area-delay efficient adder architectures – such as the ripple-carry, the carry-increment, and the carry-lookahead adders – for the entire range of possible area-delay trade-offs. The generic description of these adders as prefix structures allows their simple and consistent area optimization and synthesis under given timing constraints, inc...
متن کاملDelay Aware Optimization of Multiplierless Linear Systems Using Two Term Continuous Arithmetic Extraction
We present a technique for redundancy elimination in multiplierless linear systems, such that the critical path of the computations is not increased. To the best of our knowledge this is the only method that combines common subexpression elimination and delay optimization in one single step. We assume that all the constant multiplications are decomposed into additions/subtractions and shift ope...
متن کاملFaster Adder Circuits for Inputs with Prescribed Arrival Times
We present an algorithm that computes a Boolean circuit for an AND-OR path (i.e., a formula of type t0∧(t1∨(t2∧(. . . tm−1) . . . ) or t0∨(t1∧(t2∨(. . . tm−1) . . . )) with given arrival times for the input signals. Our objective function is delay, a generalization of depth. The maximum delay of the circuit we compute is log2 W+log2 log2 m+log2 log2 log2 m+5, where dlog2 W e is a lower bound on...
متن کاملHigh-Performance Left-to-Right Array Multiplier Design
We propose a split array multiplier organized in a left-to-right leapfrog (LRLF) structure with reduced delay compared to conventional array multipliers. Moreover, the proposed design shows equivalent performance as tree multipliers for n ≤ 32. An efficient radix-4 recoding logic generates the partial products in a left-to-right order. The partial products are split into upper and lower groups....
متن کامل